Search for: All records

Abstract Training of neural networks (NNs) has emerged as a major consumer of both computational and energy resources. Quantum computers were coined as a root to facilitate training, but no experimental evidence has been presented so far. Here we demonstrate that quantum annealing platforms, such as D-Wave, can enable fast and efficient training of classical NNs, which are then deployable on conventional hardware. From a physics perspective, NN training can be viewed as a dynamical phase transition: the system evolves from an initial spin glass state to a highly ordered, trained state. This process involves eliminating numerous undesired minima in its energy landscape. The advantage of annealing devices is their ability to rapidly find multiple deep states. We found that this quantum training achieves superior performance scaling compared to classical backpropagation methods, with a clearly higher scaling exponent (1.01 vs. 0.78). It may be further increased up to a factor of 2 with a fully coherent quantum platform using a variant of the Grover algorithm. Furthermore, we argue that even a modestly sized annealer can be beneficial to train a deep NN by being applied sequentially to a few layers at a time. 

Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time hypothesis, its computational complexity was proven to be no less than $2^{N^{2/3}}$, where $N$is the total number of spins. Here, we report results of extensive experimentation with D-Wave 3D annealer with $N\le 5627$. We found exact ground states (in a probabilistic sense) for typical realizations of 3D spin glasses with the efficiency, which scales as $2^{N/\beta }$with $\beta \approx {10}^3$. Based on statistical analysis of low-energy states, we argue that with an improvement of annealing protocols and device noise reduction, $\beta$can be increased even further. This suggests that, for $N<{\beta }^3$, annealing devices provide most efficient way to find an exact ground state. 

We demonstrate an exact equivalence between classical population dynamics and Lindbladian evolution admitting a dark state and obeying a set of certain local symmetries. We then introduce quantum population dynamics as models in which this local symmetry condition is relaxed. This allows for non-classical processes in which animals behave like Schrödinger’s cat and enter superpositions of live and dead states, thus resulting in coherent superpositions of different population numbers. We develop a field theory treatment of quantum population models as a synthesis of Keldysh and third quantization techniques and draw comparisons to the stochastic Doi-Peliti field theory description of classical population models. We apply this formalism to study a prototypical “Schrödinger cat” population model on ad $d$-dimensional lattice, which exhibits a phase transition between a dark extinct phase and an active phase that supports a stable quantum population. Using a perturbative renormalization group approach, we find a critical scaling of the Schrödinger cat population distinct from that observed in both classical population dynamics and usual quantum phase transitions. 

Abstract Quantum computers promise a qualitative speedup in solving a broad spectrum of practical optimization problems. The latter can be mapped onto the task of finding low-energy states of spin glasses, which is known to be exceedingly difficult. Using D-Wave’s 5000-qubit quantum processor, we demonstrate that a recently proposed iterative cyclic quantum annealing algorithm can find deep low-energy states in record time. We also find intricate structures in a low-energy landscape of spin glasses, such as a power-law distribution of connected clusters with a small surface energy. These observations offer guidance for further improvement of the optimization algorithms.